Robust Variable Selection Method Based on Huberized LARS-Lasso Regression
نویسندگان
چکیده
منابع مشابه
Regularizing Lasso: a Consistent Variable Selection Method
Table 1 provides the average computational time (in minutes) for the eight methods under the simulation settings. SIS clearly requires the least computational effort, whereas RLASSO as well as Scout require much longer computational time. But all methods except RLASSO(CLIME) can be computed under a reasonable amount of time for p = 5000 and n = 100. RLASSO(CLIME) takes much longer because of in...
متن کاملA Novel Resampling Method for Variable Selection in Robust Regression
Variable selection in regression analysis is of vital importance for data analyst and researcher to fit the parsimonious regression model. With the inundation of large number of predictor variables and large data sets requiring analysis and empirical modeling, contamination becomes usual problem. Accordingly, robust regression estimators are designed to easily fit contaminated data sets. In the...
متن کاملRobust Regression Shrinkage and Consistent Variable Selection Through the LAD-Lasso
The least absolute deviation (LAD) regression is a useful method for robust regression, and the least absolute shrinkage and selection operator (lasso) is a popular choice for shrinkage estimation and variable selection. In this article we combine these two classical ideas together to produce LAD-lasso. Compared with the LAD regression, LAD-lasso can do parameter estimation and variable selecti...
متن کاملRobust Adaptive Lasso method for parameter’s estimation and variable selection in high-dimensional sparse models
High dimensional data are commonly encountered in various scientific fields and pose great challenges to modern statistical analysis. To address this issue different penalized regression procedures have been introduced in the litrature, but these methods cannot cope with the problem of outliers and leverage points in the heavy tailed high dimensional data. For this purppose, a new Robust Adapti...
متن کاملBranch and bound method for regression-based controlled variable selection
Self-optimizing control is a promising method for selection of controlled variables (CVs) from available measurements. Recently, Ye et al. [2012] have proposed a globally optimal method for selection of self-optimizing CVs by converting the CV selection problem into a regression problem. In this approach, the necessary conditions of optimality (NCO) are approximated with linear combinations of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH
سال: 2020
ISSN: 0424-267X,1842-3264
DOI: 10.24818/18423264/54.3.20.09